Approximate Matching of Hand-Drawn Pictograms

نویسندگان

  • Daniel P. Lopresti
  • Andrew Tomkins
چکیده

We describe a new naming paradigm for pen-based computing which we call Pictographic Naming. Using our approach, traditional character-by-character handwriting recognition (HWX) is avoided. Instead, we use a combination of user interface conventions and approximate matching techniques. Since pictographic names incorporate pen-stroke data, they can never be reproduced exactly, so name lookup becomes a small-dictionary recognition problem. We give efficient algorithms for this problem, and show that we can accurately look up handwritten names in English and Japanese over a reasonably sized dictionary.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Putting Privacy Pictograms into Practice - a European Perspective

Recent proposals for privacy pictograms show a growing interest of simplifying privacy-related statements. Such pictograms can be useful to enhance the users’ understanding of privacy issues and empower to react accordingly. In this text we bring together various mostly independently developed approaches and compare them with each other. We distinguish different categories, e.g., pictograms for...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

An efficient graph-based recognizer for hand-drawn symbols

We describe a trainable, multi-stroke symbol recognizer for pen-based user interfaces. The approach is insensitive to orientation, nonuniform scaling, and drawing order. Symbols are represented internally as attributed relational graphs describing both the geometry and topology of the symbols. Symbol definitions are statistical models, which makes the approach robust to variations common in han...

متن کامل

Invariant Recognition of Hand-Drawn Pictograms Using HMMs with a Rotating Feature Extraction

In this paper, we present a new feature extraction technique and a novel Hidden Markov Model (HMM) based classifier for the rotation, translation and scale invariant recognition of handdrawn pictograms. The feature extraction is performed by taking a fixed dimensional vector along the radius of a circle surrounding the pictogram. Within the HMM-framework these features are used to classify the ...

متن کامل

The matching interdiction problem in dendrimers

The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993